منابع مشابه
Asymptotic algorithm for computing the sample variance of interval data
The problem of the sample variance computation for epistemic inter-val-valued data is, in general, NP-hard. Therefore, known efficient algorithms for computing variance require strong restrictions on admissible intervals like the no-subset property or heavy limitations on the number of possible intersections between intervals. A new asymptotic algorithm for computing the upper bound of the samp...
متن کاملVariance-minimization scheme for optimizing Jastrow factors
We describe a scheme for optimizing many-electron trial wave functions by minimizing the unreweighted variance of the energy using stochastic integration and correlated-sampling techniques. The scheme is restricted to parameters that are linear in the exponent of a Jastrow correlation factor, which are the most important parameters in the wave functions we use. The scheme is highly efficient an...
متن کاملA Probability Sampling Approach for Variance Minimization
A number of techniques for probability sampling without replacement (SWOR) have been suggested, although it is not clear which method is consistently superior in terms of statistical efficiency. Rao and Bayless (1969) empirically studied the stability of estimators of the population total for a variety of methods of unequal probability SWOR when selecting two units per stratum. One of their maj...
متن کاملMinimization Algorithm for Symbolic Bisimilarity
The operational semantics of interactive systems is usually described by labeled transition systems. Abstract semantics is defined in terms of bisimilarity that, in the finite case, can be computed via the well-known partition refinement algorithm. However, the behaviour of interactive systems is in many cases infinite and thus checking bisimilarity in this way is unfeasible. Symbolic semantics...
متن کاملMulti-machine Scheduling with Variance Minimization
This paper addresses the problem of scheduling n jobs on m identical parallel machines so as to minimize the completion time variance. Properties of optimal solutions are derived first. Then, complexity results are obtained, which show that the problem is NP-complete in the strong sense when m is arbitrary, and NP-complete in the ordinary sense when m is fixed. Two algorithms are proposed. The ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Computer Journal
سال: 1968
ISSN: 0010-4620,1460-2067
DOI: 10.1093/comjnl/10.4.406